0.00/0.10	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.10	% Command    : run_E %s %d THM
0.09/0.30	% Computer : n016.cluster.edu
0.09/0.30	% Model    : x86_64 x86_64
0.09/0.30	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.30	% Memory   : 8042.1875MB
0.09/0.30	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.30	% CPULimit   : 1440
0.09/0.30	% WCLimit    : 180
0.09/0.30	% DateTime   : Thu Jul  4 09:22:39 EDT 2024
0.09/0.30	% CPUTime    : 
0.15/0.41	Running higher-order theorem proving
0.75/1.02	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.HdCLHiD6Tk/E---3.1_21516.p
10.96/2.62	# Version: 3.2.0-ho
10.96/2.62	# Preprocessing class: HMLMSMSLSSLNSFA.
10.96/2.62	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
10.96/2.62	# Starting new_bool_1 with 900s (5) cores
10.96/2.62	# Starting post_as_ho6 with 180s (1) cores
10.96/2.62	# Starting post_as_ho8 with 180s (1) cores
10.96/2.62	# Starting pre_casc_4 with 180s (1) cores
10.96/2.62	# new_bool_1 with pid 21595 completed with status 0
10.96/2.62	# Result found by new_bool_1
10.96/2.62	# Preprocessing class: HMLMSMSLSSLNSFA.
10.96/2.62	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
10.96/2.62	# Starting new_bool_1 with 900s (5) cores
10.96/2.62	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
10.96/2.62	# Search class: HGHSM-SMLM32-DSFFFFNN
10.96/2.62	# partial match(1): HGHSM-SMLM32-DSFFFFBN
10.96/2.62	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
10.96/2.62	# Starting post_as_ho7 with 541s (1) cores
10.96/2.62	# Starting post_as_ho8 with 91s (1) cores
10.96/2.62	# Starting full_lambda_3 with 91s (1) cores
10.96/2.62	# Starting post_as_ho6 with 91s (1) cores
10.96/2.62	# Starting new_bool_1 with 86s (1) cores
10.96/2.62	# post_as_ho8 with pid 21603 completed with status 0
10.96/2.62	# Result found by post_as_ho8
10.96/2.62	# Preprocessing class: HMLMSMSLSSLNSFA.
10.96/2.62	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
10.96/2.62	# Starting new_bool_1 with 900s (5) cores
10.96/2.62	# SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
10.96/2.62	# Search class: HGHSM-SMLM32-DSFFFFNN
10.96/2.62	# partial match(1): HGHSM-SMLM32-DSFFFFBN
10.96/2.62	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
10.96/2.62	# Starting post_as_ho7 with 541s (1) cores
10.96/2.62	# Starting post_as_ho8 with 91s (1) cores
10.96/2.62	# Preprocessing time       : 0.039 s
10.96/2.62	# Presaturation interreduction done
10.96/2.62	
10.96/2.62	# Proof found!
10.96/2.62	# SZS status Theorem
10.96/2.62	# SZS output start CNFRefutation
10.96/2.62	thf(decl_sort1, type, del: $tType).
10.96/2.62	thf(decl_22, type, bool: del).
10.96/2.62	thf(decl_24, type, arr: del > del > del).
10.96/2.62	thf(decl_25, type, mem: $i > del > $o).
10.96/2.62	thf(decl_26, type, ap: $i > $i > $i).
10.96/2.62	thf(decl_199, type, c_2Epair_2ECURRY: del > del > del > $i).
10.96/2.62	thf(decl_207, type, c_2Epair_2EUNCURRY: del > del > del > $i).
10.96/2.62	thf(decl_499, type, c_2Eset__relation_2Erel__to__reln: del > del > $i).
10.96/2.62	thf(decl_500, type, c_2Eset__relation_2Ereln__to__rel: del > del > $i).
10.96/2.62	thf(decl_515, type, esk1_0: del).
10.96/2.62	thf(decl_516, type, esk2_0: del).
10.96/2.62	thf(decl_517, type, esk3_0: $i).
10.96/2.62	thf(conj_thm_2Eset__relation_2Erel__to__reln__inv, conjecture, ![X13:del, X34:del, X195:$i]:(((mem @ X195 @ (arr @ X13 @ (arr @ X34 @ bool)))=>((ap @ (c_2Eset__relation_2Ereln__to__rel @ X13 @ X34) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ X13 @ X34) @ X195))=(X195)))), file('/export/starexec/sandbox2/tmp/tmp.HdCLHiD6Tk/E---3.1_21516.p', conj_thm_2Eset__relation_2Erel__to__reln__inv)).
10.96/2.62	thf(conj_thm_2Epair_2ECURRY__UNCURRY__THM, axiom, ![X13:del, X34:del, X66:del, X49:$i]:((((ap @ (c_2Epair_2ECURRY @ X13 @ X34 @ X66) @ (ap @ (c_2Epair_2EUNCURRY @ X13 @ X34 @ X66) @ X49))=(X49))<=(mem @ X49 @ (arr @ X13 @ (arr @ X34 @ X66))))), file('/export/starexec/sandbox2/tmp/tmp.HdCLHiD6Tk/E---3.1_21516.p', conj_thm_2Epair_2ECURRY__UNCURRY__THM)).
10.96/2.62	thf(conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY, axiom, ![X13:del, X34:del]:(((c_2Eset__relation_2Ereln__to__rel @ X13 @ X34)=(c_2Epair_2ECURRY @ X13 @ X34 @ bool))), file('/export/starexec/sandbox2/tmp/tmp.HdCLHiD6Tk/E---3.1_21516.p', conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY)).
10.96/2.62	thf(conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY, axiom, ![X13:del, X34:del]:(((c_2Eset__relation_2Erel__to__reln @ X13 @ X34)=(c_2Epair_2EUNCURRY @ X13 @ X34 @ bool))), file('/export/starexec/sandbox2/tmp/tmp.HdCLHiD6Tk/E---3.1_21516.p', conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY)).
10.96/2.62	thf(c_0_4, negated_conjecture, ~(![X13:del, X34:del, X195:$i]:(((mem @ X195 @ (arr @ X13 @ (arr @ X34 @ bool)))=>((ap @ (c_2Eset__relation_2Ereln__to__rel @ X13 @ X34) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ X13 @ X34) @ X195))=(X195))))), inference(assume_negation,[status(cth)],[conj_thm_2Eset__relation_2Erel__to__reln__inv])).
10.96/2.62	thf(c_0_5, plain, ![X13:del, X34:del, X66:del, X49:$i]:(((mem @ X49 @ (arr @ X13 @ (arr @ X34 @ X66)))=>((ap @ (c_2Epair_2ECURRY @ X13 @ X34 @ X66) @ (ap @ (c_2Epair_2EUNCURRY @ X13 @ X34 @ X66) @ X49))=(X49)))), inference(fof_simplification,[status(thm)],[conj_thm_2Epair_2ECURRY__UNCURRY__THM])).
10.96/2.62	thf(c_0_6, negated_conjecture, ((mem @ esk3_0 @ (arr @ esk1_0 @ (arr @ esk2_0 @ bool)))&((ap @ (c_2Eset__relation_2Ereln__to__rel @ esk1_0 @ esk2_0) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ esk1_0 @ esk2_0) @ esk3_0))!=(esk3_0))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])).
10.96/2.62	thf(c_0_7, plain, ![X3601:del, X3602:del]:(((c_2Eset__relation_2Ereln__to__rel @ X3601 @ X3602)=(c_2Epair_2ECURRY @ X3601 @ X3602 @ bool))), inference(variable_rename,[status(thm)],[conj_thm_2Eset__relation_2Ereln__to__rel__IS__CURRY])).
10.96/2.62	thf(c_0_8, plain, ![X3588:del, X3589:del]:(((c_2Eset__relation_2Erel__to__reln @ X3588 @ X3589)=(c_2Epair_2EUNCURRY @ X3588 @ X3589 @ bool))), inference(variable_rename,[status(thm)],[conj_thm_2Eset__relation_2Erel__to__reln__IS__UNCURRY])).
10.96/2.62	thf(c_0_9, plain, ![X4422:del, X4423:del, X4424:del, X4425:$i]:((~(mem @ X4425 @ (arr @ X4422 @ (arr @ X4423 @ X4424)))|((ap @ (c_2Epair_2ECURRY @ X4422 @ X4423 @ X4424) @ (ap @ (c_2Epair_2EUNCURRY @ X4422 @ X4423 @ X4424) @ X4425))=(X4425)))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])).
10.96/2.62	thf(c_0_10, negated_conjecture, ((ap @ (c_2Eset__relation_2Ereln__to__rel @ esk1_0 @ esk2_0) @ (ap @ (c_2Eset__relation_2Erel__to__reln @ esk1_0 @ esk2_0) @ esk3_0))!=(esk3_0)), inference(split_conjunct,[status(thm)],[c_0_6])).
10.96/2.62	thf(c_0_11, plain, ![X1:del, X2:del]:(((c_2Eset__relation_2Ereln__to__rel @ X1 @ X2)=(c_2Epair_2ECURRY @ X1 @ X2 @ bool))), inference(split_conjunct,[status(thm)],[c_0_7])).
10.96/2.62	thf(c_0_12, plain, ![X1:del, X2:del]:(((c_2Eset__relation_2Erel__to__reln @ X1 @ X2)=(c_2Epair_2EUNCURRY @ X1 @ X2 @ bool))), inference(split_conjunct,[status(thm)],[c_0_8])).
10.96/2.62	thf(c_0_13, plain, ![X1:del, X2:del, X3:$i, X13:del]:((((ap @ (c_2Epair_2ECURRY @ X1 @ X2 @ X13) @ (ap @ (c_2Epair_2EUNCURRY @ X1 @ X2 @ X13) @ X3))=(X3))|~((mem @ X3 @ (arr @ X1 @ (arr @ X2 @ X13)))))), inference(split_conjunct,[status(thm)],[c_0_9])).
10.96/2.62	thf(c_0_14, negated_conjecture, (mem @ esk3_0 @ (arr @ esk1_0 @ (arr @ esk2_0 @ bool))), inference(split_conjunct,[status(thm)],[c_0_6])).
10.96/2.62	thf(c_0_15, negated_conjecture, ((ap @ (c_2Epair_2ECURRY @ esk1_0 @ esk2_0 @ bool) @ (ap @ (c_2Epair_2EUNCURRY @ esk1_0 @ esk2_0 @ bool) @ esk3_0))!=(esk3_0)), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10, c_0_11]), c_0_12])).
10.96/2.62	thf(c_0_16, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_13, c_0_14]), c_0_15]), ['proof']).
10.96/2.62	# SZS output end CNFRefutation
10.96/2.62	# Parsed axioms                        : 3387
10.96/2.62	# Removed by relevancy pruning/SinE    : 2813
10.96/2.62	# Initial clauses                      : 2140
10.96/2.62	# Removed in clause preprocessing      : 930
10.96/2.62	# Initial clauses in saturation        : 1210
10.96/2.62	# Processed clauses                    : 2072
10.96/2.62	# ...of these trivial                  : 15
10.96/2.62	# ...subsumed                          : 197
10.96/2.62	# ...remaining for further processing  : 1860
10.96/2.62	# Other redundant clauses eliminated   : 310
10.96/2.62	# Clauses deleted for lack of memory   : 0
10.96/2.62	# Backward-subsumed                    : 3
10.96/2.62	# Backward-rewritten                   : 9
10.96/2.62	# Generated clauses                    : 16728
10.96/2.62	# ...of the previous two non-redundant : 16247
10.96/2.62	# ...aggressively subsumed             : 0
10.96/2.62	# Contextual simplify-reflections      : 3
10.96/2.62	# Paramodulations                      : 16082
10.96/2.62	# Factorizations                       : 4
10.96/2.62	# NegExts                              : 28
10.96/2.62	# Equation resolutions                 : 316
10.96/2.62	# Disequality decompositions           : 0
10.96/2.62	# Total rewrite steps                  : 813
10.96/2.62	# ...of those cached                   : 724
10.96/2.62	# Propositional unsat checks           : 0
10.96/2.62	#    Propositional check models        : 0
10.96/2.62	#    Propositional check unsatisfiable : 0
10.96/2.62	#    Propositional clauses             : 0
10.96/2.62	#    Propositional clauses after purity: 0
10.96/2.62	#    Propositional unsat core size     : 0
10.96/2.62	#    Propositional preprocessing time  : 0.000
10.96/2.62	#    Propositional encoding time       : 0.000
10.96/2.62	#    Propositional solver time         : 0.000
10.96/2.62	#    Success case prop preproc time    : 0.000
10.96/2.62	#    Success case prop encoding time   : 0.000
10.96/2.62	#    Success case prop solver time     : 0.000
10.96/2.62	# Current number of processed clauses  : 711
10.96/2.62	#    Positive orientable unit clauses  : 148
10.96/2.62	#    Positive unorientable unit clauses: 9
10.96/2.62	#    Negative unit clauses             : 43
10.96/2.62	#    Non-unit-clauses                  : 511
10.96/2.62	# Current number of unprocessed clauses: 16392
10.96/2.62	# ...number of literals in the above   : 83105
10.96/2.62	# Current number of archived formulas  : 0
10.96/2.62	# Current number of archived clauses   : 1083
10.96/2.62	# Clause-clause subsumption calls (NU) : 370620
10.96/2.62	# Rec. Clause-clause subsumption calls : 20458
10.96/2.62	# Non-unit clause-clause subsumptions  : 155
10.96/2.62	# Unit Clause-clause subsumption calls : 551
10.96/2.62	# Rewrite failures with RHS unbound    : 0
10.96/2.62	# BW rewrite match attempts            : 3366
10.96/2.62	# BW rewrite match successes           : 45
10.96/2.62	# Condensation attempts                : 2072
10.96/2.62	# Condensation successes               : 9
10.96/2.62	# Termbank termtop insertions          : 805001
10.96/2.62	# Search garbage collected termcells   : 87116
10.96/2.62	
10.96/2.62	# -------------------------------------------------
10.96/2.62	# User time                : 1.293 s
10.96/2.62	# System time              : 0.041 s
10.96/2.62	# Total time               : 1.334 s
10.96/2.62	# Maximum resident set size: 16284 pages
10.96/2.62	
10.96/2.62	# -------------------------------------------------
10.96/2.62	# User time                : 5.923 s
10.96/2.62	# System time              : 0.242 s
10.96/2.62	# Total time               : 6.165 s
10.96/2.62	# Maximum resident set size: 9212 pages
10.96/2.62	% E---3.1 exiting
10.96/2.62	% E exiting
10.96/2.62	EOF
